COG366 Demo Page

Following is a demo of the ? program.

Solve(Steps)
Steps = [putOn(b3, b1), putOn(b2, b3), putOn(b5, b6), putOn(b4, b5), putOn(b7, b4), putOn(b8, b7)]


%%Task 3

%% After finally solving the problem came a realization that coming from a computer science background I had a 
%%disadvantage as I was looking at it through OOP lenses.
%%And had to go logically like cog sci problem.The problem looks for the number of stacks. 
%%Then the program takes the first stack it finds and works from outside in 
%%until the stack is complete or goal is reached.
%%If the stack is done but goal not reached the program will work its way to the next stack and continue until goal is reached